7 On P vs . NP , Geometric Complexity Theory , and The Flip I : a high - level view Dedicated to Sri
نویسندگان
چکیده
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.
منابع مشابه
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.
متن کامل9 On P vs . NP , Geometric Complexity Theory , Explicit Proofs and the Complexity Barrier Dedicated to Sri Ramakrishna
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
متن کاملGeometric Complexity Theory VI: The flip via positivity
Geometric complexity theory (GCT) is an approach towards the P vs. NP and related problems. The article [GCTflip] describes its defining strategy, called the flip, to resolve the self referential paradox, which is the root difficulty in these problems. This article describes an approach based on positivity hypotheses in algebraic geometry and representation theory to implement the flip and ther...
متن کاملA ug 2 00 9 On P vs . NP , Geometric Complexity Theory , and the Riemann Hypothesis Dedicated to Sri
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems suggested in a series of articles we call GCTlocal [26], GCT1-8 [29]-[33], and GCTflip [27]. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced study, Princeton, Feb 9-11, 2009. This article contains the material ...
متن کاملExplicit Proofs and The Flip
This article describes a formal strategy of geometric complexity theory (GCT) to resolve the self referential paradox in the P vs. NP and related problems. The strategy, called the flip, is to go for explicit proofs of these problems. By an explicit proof we mean a proof that constructs proof certificates of hardness that are easy to verify, construct and decode. The main result in this paper s...
متن کامل